Clustering with shallow trees

نویسندگان

  • Marc Bailly-Bechet
  • S. Bradde
  • Alfredo Braunstein
  • A. Flaxman
  • L. Foini
  • Riccardo Zecchina
چکیده

We propose a new method for hierarchical clustering based on the optimisation of a cost function over trees of limited depth, and we derive a message–passing method that allows to solve it efficiently. The method and algorithm can be interpreted as a natural interpolation between two well-known approaches, namely single linkage and the recently presented Affinity Propagation. We analyze with this general scheme three biological/medical structured datasets (human population based on genetic information, proteins based on sequences and verbal autopsies) and show that the interpolation technique provides new insight.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discovering Relations Between Named Entities from a Large Raw Corpus Using Tree Similarity-Based Clustering

We propose a tree-similarity-based unsupervised learning method to extract relations between Named Entities from a large raw corpus. Our method regards relation extraction as a clustering problem on shallow parse trees. First, we modify previous tree kernels on relation extraction to estimate the similarity between parse trees more efficiently. Then, the similarity between parse trees is used i...

متن کامل

Isolation and Characterization of Brenneria nigrifluens Causing Bacterial Shallow Bark Canker of Walnut Trees in Golestan Province, Iran

Shallow bark canker incited by Brenneria nigrifluens is considered one of the most dangerous diseases which can cause a significant reduction in walnut and timber production.  During spring and summer of 2019, walnut gardens were surveyed for symptoms like leaf spot, fruit, and stem canker from four different regions of Golestan province located in Iran. A set of 11 Gram-negative bacteria were ...

متن کامل

Organizing image databases as visual-content search trees

An unsupervised algorithm for arranging an image database as a visual-content binary search tree is described. Tree nodes are associated with image subsets, maintaining the property that the similarity among the images associated with the children of a node is higher than the similarity among the images associated with the parent node. Visual-content search trees can be used to automate image r...

متن کامل

Indexing Images by Trees of Visual Content

Haim Schweitzer ([email protected]) The University of Texas at Dallas P.O Box 830688, Richardson, Texas 75083 Abstract An unsupervised algorithm for arranging an image database as a binary tree is described. Tree nodes are associated with image subsets, maintaining the property that the similarity among the images associated with the children of a node is higher than the similarity among the im...

متن کامل

Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections

We consider a generalization of the uncapacitated facility location problem that occurs in planning of optical access networks in telecommunications. Clients are connected to open facilities via depthbounded trees. The total demand of clients served by a tree must not exceed a given tree capacity. We investigate a framework for combining facility location algorithms with a tree-based clustering...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/0910.0767  شماره 

صفحات  -

تاریخ انتشار 2009